Multiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems

Some new restart vectors for explicitly restarted Arnoldi method

The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...

A Global Arnoldi Method for Large non-Hermitian Eigenproblems with Special Applications to Multiple Eigenproblems∗

Global projection methods have been used for solving numerous large matrix equations, but nothing has been known on if and how a global projection method can be proposed for solving large eigenproblems. In this paper, based on the global Arnoldi process that generates an Forthonormal basis of a matrix Krylov subspace, a global Arnold method is proposed for large eigenproblems. It computes certa...

An asynchronous algorithm on the NetSolve global computing system

The explicitly restarted Arnoldi method (ERAM) allows one to find a few eigenpairs of a large sparse matrix. The multiple explicitly restarted Arnoldi method (MERAM) is a technique based upon a multiple projection of ERAM and accelerates its c S i t c a t ©

A Comparison Between Parallel Multiple Explicitly Restarted and Explicitly Restarted Block Arnoldi Methods

Least Squares Arnoldi for Large Nonsymmetric Eigenproblems

In this paper, we propose a highly e cient accelerating method for the restarted Arnoldi iteration to compute the eigenvalues of a large nonsymmetric matrix. Its e ectiveness is proved by various numerical experiments and comparisons with other approaches. Several new results on the characteristics of the polynomial acceleration are also reported. The Arnoldi iteration has been the most popular...